#include <iostream>
#include <vector>

using namespace std;

class Solution {
public:
    int searchInsert(vector<int>& nums, int target)
    {
        for (int i = 0; i < nums.size(); i++) {
            if(target <= nums[i])
                return i;
        }
        return nums.size();
    }
};

int main(int argc, char const* argv[])
{
    Solution temp;
    int a[10] = { 0, 0, 1, 1, 1, 2, 2, 3, 3, 4 };
    vector<int> nums(a, a + 10);
    temp.searchInsert(nums, 1);
    return 0;
}